Online algorithms

Results: 217



#Item
31Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:28
32CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:34:37
33Dynamic Bin Packing of Unit Fractions Items Joseph Wun-Tat Chan† Tak-Wah Lam‡  ∗

Dynamic Bin Packing of Unit Fractions Items Joseph Wun-Tat Chan† Tak-Wah Lam‡ ∗

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-04-19 01:25:32
34On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty  Oliver Gielz

On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty Oliver Gielz

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:07
35Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany

Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 10:58:01
36On Generalized Connection Caching Susanne Albers Abstract Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where

On Generalized Connection Caching Susanne Albers Abstract Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:47
37CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-01 15:15:38
38Mathemati
al Programming manus
ript No.  (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Mathemati al Programming manus ript No. (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:03:55
39CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-01-04 19:18:44
40New Results on Web Caching with Request Reordering Susanne Albers Abstract We study web caching with request reordering. The goal is to maintain a cache of web documents so that a sequence of requests can be served at l

New Results on Web Caching with Request Reordering Susanne Albers Abstract We study web caching with request reordering. The goal is to maintain a cache of web documents so that a sequence of requests can be served at l

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:03:09